Computing similarity distances between rankings
نویسندگان
چکیده
منابع مشابه
Computing Similarity Distances Between Rankings
We address the problem of computing distances between permutations that take into account similarities between elements of the ground set dictated by a graph. The problem may be summarized as follows: Given two permutations and a positive cost function on transpositions that depends on the similarity of the elements involved, find a smallest cost sequence of transpositions that converts one per...
متن کاملComputing distances between partial rankings
We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(n log n/ log log n) time, and the second in O(n log min{b, c}) time.
متن کاملKantorovich Distances between Rankings with Applications to Rank Aggregation
The goal of this paper is threefold. It first describes a novel way of measuring disagreement between rankings of a finite set X of n ≥ 1 elements, that can be viewed as a (mass transportation) Kantorovich metric, once the collection rankings of X is embedded in the set Kn of n× n doubly-stochastic matrices. It also shows that such an embedding makes it possible to define a natural notion of me...
متن کاملComputing Distances between Probabilistic Automata
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error ε . When ε = 0 we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L and L ¬, by the modal operator. Using flow networks, we show how to compute the r...
متن کاملComputing Distances between Evolutionary Trees
Supported in part by a CGAT (Canadian Genome Analysis and Technology) grant. Work done while the author was at McMaster University and University of Waterloo. Supported in part by NSF grant 9205982 and CGAT. Supported in part by NSERC Operating Grant OGP0046613 and CGAT. Supported in part by the NSERC Operating Grant OGP0046506 and CGAT. Supported in part by CGAT and NSERC Internation Fellowshi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.07.038